Pairwise kidney exchange

نویسندگان

  • Alvin E. Roth
  • Tayfun Sönmez
  • M. Utku Ünver
چکیده

In connection with an earlier paper on the exchange of live donor kidneys (Roth, Sönmez, and Ünver 2004) the authors entered into discussions with New England transplant surgeons and their colleagues in the transplant community, aimed at implementing a Kidney Exchange program. In the course of those discussions it became clear that a likely …rst step will be to implement pairwise exchanges, between just two patient-donor pairs, as these are logistically simpler than exchanges involving more than two pairs. Furthermore, the experience of these surgeons suggests to them that patient and surgeon preferences over kidneys should be 0-1, i.e. that patients and surgeons should be indi¤erent among kidneys from healthy donors whose kidneys are compatible with the patient. This is because, in the United States, transplants of compatible live kidneys have about equal graft survival probabilities, regardless of the closeness of tissue types between patient and donor (unless there is a rare perfect match). In the present paper we show that, although the pairwise constraint eliminates some potential exchanges, there is a wide class of constrained-e¢ cient mechanisms that are strategy-proof when patientdonor pairs and surgeons have 0-1 preferences. This class of mechanisms includes deterministic mechanisms that would accomodate the kinds of priority setting that organ banks currently use for the allocation of cadaver organs, as well as stochastic mechanisms that allow considerations of distributive justice to be addressed. We would like to thank Anna Bogomolnaia, Frank Delmonico, Hervé Moulin, Muriel Niederle, Susan Saidman, and Jen Stack for helpful comments and conversations. Sönmez gratefully acknowledges the research support of KoçBank via the KoçBank scholar program and Turkish Academy of Sciences in the framework of the Young Scientist Award Program via grant TS/TÜBA-GEB· IP/2002-1-19, and Roth and Ünver acknowledge support from the NSF. Any errors are our own responsibility. yE-mail: [email protected]; address: Harvard University, Department of Economics, Cambridge, MA 02138 and Harvard Business School, Boston, MA 02163. zE-mail: [email protected]; address: Koç University, Department of Economics, College of Administrative Sciences and Economics, Rumeli Feneri Yolu, Sar¬yer, · Istanbul, 34450, Turkey. xE-mail: [email protected]; address: Koç University, Department of Economics, College of Administrative Sciences and Economics, Rumeli Feneri Yolu, Sar¬yer, · Istanbul, 34450, Turkey.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pairwise kidney exchange: Comment

In their recent paper, Roth et al. [Pairwise kidney exchange, J. Econ. Theory 125 (2005) 151–188] consider pairwise kidney exchanges, and show within this subset of feasible exchanges that a priority mechanism is strategy-proof. We show that this result can be broadened to allow much more general mechanisms and restrictions on the feasible set of allocations, including allowing three-way exchan...

متن کامل

Low-Risk Mechanisms for the Kidney Exchange Game

In this paper we consider the pairwise kidney exchange game. This game naturally appears in situations that some service providers benefit from pairwise allocations on a network, such as the kidney exchanges between hospitals. Ashlagi et al. [1] present a 2-approximation randomized truthful mechanism for this problem. This is the best known result in this setting with multiple players. However,...

متن کامل

Age-based preferences in paired kidney exchange

We consider a model of Paired Kidney Exchange (PKE) with feasibility con-straints on the number of patient-donor pairs involved in exchanges. Patients’preferences are restricted so that patients prefer kidneys from compatible youngerdonors to kidneys from older donors. In this framework, patients with compati-ble donors may enroll on PKE programs to receive an organ with higher ...

متن کامل

Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow

We revisit the pairwise kidney exchange problem established by Roth Sonmez and Unver [23]. Our goal, explained in terms of graph theory, is to find a maximum fractional matching on an undirected graph, that Lorenz-dominates any other fractional matching. The Lorenz-dominant fractional matching, which can be implemented as a lottery of integral matchings, is in some sense the fairest allocation ...

متن کامل

Two Approaches on Pairwise Key Path Establishment for Sensor Networks

Developments on WSN technologies have made applications of ubiquitous computing available in recent a few years. The properties of weak connectivity in subsection based on hypercube model are addressed, for purpose of achieving inner-area pairwise key establishment. Also a clustering scheme for inter-area path establishment is proposed, based on the contribution of our presented protocol for ke...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Economic Theory

دوره 125  شماره 

صفحات  -

تاریخ انتشار 2005